Random means without pattern and non-repeating. A random number is a number that is selected from a list of numbers where the list does not have a pattern and does not repeat. A random event is an event that is not part of a pattern of events. In some contexts, randomness is called 'noise'. Randomness is important in probability, statistics, quantum mechanics, and other fields in science:
|
A list of numbers is considered random if no pattern can be found and if the numbers satisfy no algorithm. Realistically speaking, the total number of patterns is infinite and the total number of algorithms is infinite, so lists of random numbers are compared to a set of well-defined number patterns, and evaluated against a set of well-defined algorithms. For more on testing the randomness of a sequence of numbers, see Testing Randomness in this article.
Since random numbers are used extensively in probability, statistics and various sciences, the generation of random numbers is an important topic. There are two types of random number generators: pseudo random number generators and true random number generators. A pseudo random number generator generates seemingly random lists of numbers from non-random events. The rand() and random() functions in most computer languages are pseudo random number generators. They use various mathematical techniques to generate numbers that have a high degree of randomness. However, research has shown that these lists are not truly random, but are pseudo random.
A true random number generator generates lists of numbers that are truly random. Two of the most common types of true random number generators use the time difference between natural events. One uses the elapsed time between radioactive decay of atoms in a radioactive sample. The other uses the elapsed time between electrical atmospheric events.
While, on the average, the total number of such events in any relatively large time frame is predictable, the exact amount of time between events is random. One free online service, Random.org, uses a very sensitive device that detects atmospheric events to generate random numbers.
In this discovery, you will learn how to generate lists of random numbers. In personal computers, random numbers are often generated by counting the milliseconds or clock cycles between keystrokes. While people tend to push keys at regular intervals, the exact timing between keystrokes has a high degree of randomness.
This discovery requires a digital watch that displays seconds, a piece of paper, a pencil and something to write on such as a clipboard or a book. Start by picking a common sound at the start of words, such as the 'g' sound in 'great'. Go to a place where you can listen to conversations. Every time you hear a word that starts with the selected sound, write the seconds down on the piece of paper. For example, if someone says 'green' and the time is 11:36:57 write down 57. When you have written down a lot of numbers (at least 32, better yet 100), take a look at your list. Do you see any pattern to the numbers? You can use the randomness tests in Discovery 2 to test your list for randomness.
Because of the importance of randomness in the sciences, there are many and extensive randomness tests have been developed to check any particular list of numbers for randomness. Most of these tests require a lot of computer power and are way beyond the scope of this encyclopedia. However, there are a few easy tests that can be performed on small lists with pencil and paper.
One such test is the oddness or evenness of the numbers in the list. If a list is truly random, about one-half of the numbers will be even and one-half odd. If the count of odd numbers and even numbers varies greatly from half and half, the randomness of the sequence is suspect. One the other hand, the probability of the count of odd and even numbers being exactly half and half is very low. Having the count of even and odd numbers be exactly half and half is also suspect.
Another test involves checking whether two consecutive numbers are both even or both odd, or if the oddness of the numbers change from one number to the next. Given two consecutive numbers from a list of random numbers, the oddness of the numbers should change about half the time and remain the same about half the time. Again, if the count of changes versus non-changes is not close to half and half, or is too close to half and half, the randomness of the list is suspect.
Use the true random number generator on this page to complete this discovery. You will need a piece of paper and a pencil. Alternatively, you can print out the worksheet at http://www.lifeisastoryproblem.com/worksheets/randomness.pdf. You will be using the true random number generator on this page to complete the discovery. You will be writing down 100 random numbers, then use the oddness and evenness of the numbers to verify that the list is a random list. In the context of probability, 100 numbers is a small list. There is a small but significant chance that your list will not seem random.
In probability, random numbers are used to simulate real life events. For example, to simulate the birth of a boy or a girl, one might use a random number generate where an odd number simulates the birth of a boy and an even number simulates the birth of a girl. For more information see Simulation.
One of the most important steps in completing a survey is selecting a random sample. Random numbers are often used to select members of a population to survey or to select a region to survey. For example, when doing exit polls during elections, the actual poling places surveyed sampled may be selected randomly from all the poling places available. Then, all of the people voting at that poling place are included in the sample.
When coming up with an encryption scheme, extensive testing is used to make sure that the encryption is hard to break. One test is the randomness of the encrypted data. If a pattern can be detected in the encrypted data, it is possible that the pattern can be used to break the encryption. Additionally, if the encryption key is changed there must be no pattern to the changes in the encrypted data.
One test performed when validating encrypt schemes involves changing one bit (a bit is a 1 or a 0) in the encryption key. The scheme passes this particular test if about one-half of the bits in the encrypted data change. There are many other test that are also performed.
# | A | B | C | D |
E | F | G | H | I |
J | K | L | M | N |
O | P | Q | R | S |
T | U | V | W | X |
Y | Z |
All Math Words Encyclopedia is a service of
Life is a Story Problem LLC.
Copyright © 2018 Life is a Story Problem LLC. All rights reserved.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License